Markovian simulation for ancestors trees
نویسندگان
چکیده
We present a computational model to reconstruct ancestor trees of animals with sexual reproduction following the theoretical model presented in Phys. Rev. E 90, 022125 (2014). Through a recursive algorithm combined with a random number generator, it is possible to reproduce the number of ancestor for each generation and use it to constraint a maximum number of the following generation. This simulation allows to consider the reproductive preferences of particular species and combine several trees to simulate the population behavior. With this approach it is also possible to describe the simulation algorithm as a theoretical stochastic process.
منابع مشابه
Monte Carlo Simulation to Compare Markovian and Neural Network Models for Reliability Assessment in Multiple AGV Manufacturing System
We compare two approaches for a Markovian model in flexible manufacturing systems (FMSs) using Monte Carlo simulation. The model which is a development of Fazlollahtabar and Saidi-Mehrabad (2013), considers two features of automated flexible manufacturing systems equipped with automated guided vehicle (AGV) namely, the reliability of machines and the reliability of AGVs in a multiple AGV jobsho...
متن کاملMarkov chains for random dynamical systems on p-adic trees
We study Markovian and non-Markovian behaviour of stochastic processes generated by random dynamical systems on p-adic trees. In fact, such systems can be interpreted as stochastic neural networks operating on branches of the homogeneous p-adic tree (where p > 1 is a prime number). Key-Words: Random dynamical systems, p-adic numbers, Markovian property
متن کاملMarkovian Delay Prediction-Based Control of Networked Systems
A new Markov-based method for real time prediction of network transmission time delays is introduced. The method considers a Multi-Layer Perceptron (MLP) neural model for the transmission network, where the number of neurons in the input layer is minimized so that the required calculations are reduced and the method can be implemented in the real-time. For this purpose, the Markov process order...
متن کاملEffects of memory on the shapes of simple outbreak trees
Genomic tools, including phylogenetic trees derived from sequence data, are increasingly used to understand outbreaks of infectious diseases. One challenge is to link phylogenetic trees to patterns of transmission. Particularly in bacteria that cause chronic infections, this inference is affected by variable infectious periods and infectivity over time. It is known that non-exponential infectio...
متن کاملExtension of some MAP results to transient MAPs and Markovian binary trees SI: Matrix-Analytic Methodology
In this work we extend previous results on moment-based characterization and minimal representation of stationary Markovian arrival processes (MAPs) and rational arrival processes (RAPs) to transient Markovian arrival processes (TMAPs) and Markovian binary trees (MBTs). We show that the number of moments that characterize a TMAP of size n with full rank marginal is n + 2n − 1, and an MBT of siz...
متن کامل